package easy;

/**
 * 2923. 找到冠军 I
 * 创建时间：2024-04-13 11:25
 * 地址：https://leetcode.cn/problems/find-champion-i/description/
 */
public class 找到冠军I_2923 {
    static class Solution {
        public int findChampion(int[][] grid) {
            next:
            for (int i = 0; ; i++) {
                for (int j = 0; j < grid.length; j++) {
                    if (i != j && grid[i][j] == 0) {
                        continue next;
                    }
                }
                return i;
            }
        }
    }
}
